A Finite-Automaton Based Stream Cipher As a Quasigroup Based Cipher
نویسندگان
چکیده
In this paper we show that a recently published finite automaton stream cipher can be considered as quasigroup based cipher. Some additional properties of the discussed are also given.
منابع مشابه
A Stream Cipher Based on Chaotic Permutations
In this paper we introduce a word-based stream cipher consisting of a chaotic part operating as a chaotic permutation and a linear part, both of which designed on a finite field. We will show that this system can operate in both synchronized and self-synchronized modes. More specifically, we show that in the self-synchronized mode the stream cipher has a receiver operating as an unknown input o...
متن کاملStream cipher based on quasigroup string transformations in Zp*
In this paper we design a stream cipher that uses the algebraic structure of the multiplicative group Z Z * p (where p is a big prime number used in ElGamal algorithm), by defining a quasigroup of order p − 1 and by doing quasigroup string transformations. The cryptograph-ical strength of the proposed stream cipher is based on the fact that breaking it would be at least as hard as solving syste...
متن کاملStream cipher based on quasigroup string transformations in ZZp
In this paper we design a stream cipher that uses the algebraic structure of the multiplicative group ZZp (where p is a big prime number used in ElGamal algorithm), by defining a quasigroup of order p− 1 and by doing quasigroup string transformations. The cryptographical strength of the proposed stream cipher is based on the fact that breaking it would be at least as hard as solving systems of ...
متن کاملQuasigroup-based Hybrid of a Code and a Cipher
We construct quasigroup-based hybrid of a code and a cipher. 2000 Mathematics Subject Classification: 94A60, 20N05, 20N15.
متن کاملDragon: A Fast Word Based Stream Cipher
This paper presents Dragon, a new stream cipher constructed using a single word based non-linear feedback shift register and a nonlinear filter function with memory. Dragon uses a variable length key and initialisation vector of 128 or 256 bits, and produces 64 bits of keystream per iteration. At the heart of Dragon are two highly optimised 8 × 32 s-boxes. Dragon uses simple operations on 32-bi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic proceedings in theoretical computer science
سال: 2022
ISSN: ['2075-2180']
DOI: https://doi.org/10.4204/eptcs.367.6